Convergence of Intra-domain Routing with Centralized Control
نویسندگان
چکیده
The decentralized control scheme for routing in current IP networks has been questioned, and a centralized routing scheme has been proposed as an alternative. In this paper, we compare the convergence of centralized control scheme with decentralized link-state routing protocols. We first identify the components of the convergence time. Thereafter, we study how to achieve fast routing convergence in networks with centralized control. In particular, we analyze how to distribute forwarding information efficiently. Finally, we perform simulation studies on the convergence time for both real and synthetic network topologies, and study the impact of control element location, link weights, and number of failures on the convergence time. The results show that the centralized control scheme can provide faster routing convergence than link-state routing protocols.
منابع مشابه
Technical Report Quality of Service Routing in MPLS Networks using Decentralized Learning
This paper presents several decentralized learning algorithms for on-line intra-domain routing of bandwidth guaranteed paths in MPLS networks when there is no a-priori knowledge of traffic demand. The presented routing algorithms use only their locally observed events and update their routing policy using learning schemes. The employed learning algorithms are either learning automata or the mul...
متن کاملOSPF Performance and Optimization of Open Source Routing Software
OSPF (Open Shortest Path First) is a widely used intra-domain routing protocol in IP networks. Processing delays in OSPF implementations impact the time needed for both intra-domain and inter-domain routing to re-convergence after a topology change. The re-convergence capability of a router can be characterized by a performance index, referred to as switching time. We have built a test-bed and ...
متن کاملSymmetrical Routes and Reverse Path Congestion Control Symmetrical Routes and Reverse Path Congestion Control
We describe new mechanisms to deal with asymmetries that arise in routing protocols. We show how to avoid route asymmetries (due to non-unique shortest paths) by adding random integer link costs. We show in detail how RIP can be modiied to avoid route asymmetry with high probability, without aaecting either its eeciency or performance metrics such as convergence time. Symmetrical intra-domain r...
متن کاملRouting centralization across domains via SDN: A model and emulation framework for BGP evolution
The Border Gateway Protocol (BGP) was designed almost three decades ago and has many limitations relating to its fully distributed nature, policy enforcement capabilities, scalability, security and complexity. For example, the control plane can take several minutes to converge after a routing change; this may be unacceptable for real-time network services. Despite many research proposals for in...
متن کاملExtending Routers Utilisability and Life Cycle through Automated Configuration Management
We present the design of a distributed router platform aimed at consolidating multiple hardware routers. The goal of the approach is twofold: firstly decouple the logical routing and forwarding functionality from the limitations of the hardware that runs it, through automated configuration management only; and secondly, give component routers a longer lease of life, as constituting parts of a l...
متن کامل